Combinatorial optimization over two random point sets
نویسندگان
چکیده
We analyze combinatorial optimization problems over a random pair of points (X ,Y) in R of equal cardinal. Typical examples include the matching of minimal length, the traveling salesperson tour constrained to alternate between points of each set, or the connected bipartite r-regular graph of minimal length. As the cardinal of the sets goes to infinity, we investigate the convergence of such bipartite functionals.
منابع مشابه
Reconstruction of irregularly sampled discrete-time bandlimited signals with unknown sampling locations
The purpose of this paper is to develop methods that can reconstruct a bandlimited discrete-time signal from an irregular set of samples at unknown locations. We define a solution to the problem using first a geometric and then an algebraic point of view. We find the locations of the irregular set of samples by treating the problem as a combinatorial optimization problem. We employ an exhaustiv...
متن کاملApproximating Incremental Combinatorial Optimization Problems
We consider incremental combinatorial optimization problems, in which a solution is constructed incrementally over time, and the goal is to optimize not the value of the final solution but the average value over all timesteps. We consider a natural algorithm of moving towards a global optimum solution as quickly as possible. We show that this algorithm provides an approximation guarantee of (9 ...
متن کاملOptimal random matchings, tours, and spanning trees in hierarchically separated trees
We derive tight bounds on the expected weights of several combinatorial optimization problems for random point sets of size n distributed among the leaves of a balanced hierarchically separated tree. We consider monochromatic and bichromatic versions of the minimum matching, minimum spanning tree, and traveling salesman problems. We also present tight concentration results for the monochromatic...
متن کامل12 Discrete Aspects of Stochastic Geometry
Stochastic geometry studies randomly generated geometric objects. The present chapter deals with some discrete aspects of stochastic geometry. We describe work that has been done on familiar objects of discrete geometry, like finite point sets, their convex hulls, discrete point sets, arrangements of flats, tessellations of space, under various assumptions of randomness. Most of the results to ...
متن کاملCs 598csc: Combinatorial Optimization
One of several major contributions of Edmonds to combinatorial optimization is algorithms and polyhedral theorems for matroid intersection, and more generally polymatroid intersection. From an optimization point of view, the matroid intersection problem is the following: Let M1 = (S, I1) and M2 = (S, I2) be two matroids on the same ground set S. Then I1 ∩ I2 is the collection of all sets that a...
متن کامل